package com.yulongtian.weekCompetition.month202302.week03;

/**
 * @author yulongTian
 * @create 2023-02-19 11:18
 */
public class Test03 {
    public static void main(String[] args) {

    }

    public static int squareFreeSubsets(int[] nums) {
        long ans = 0;
        int left = 0;
        long cheng = 1;
        for (int right = 0; right < nums.length; right++) {
            cheng *= nums[right];

        }


        return (int) (ans % (1000000000 + 7));
    }

    //判断某一个数是不是无平方因子数   无平方因子数是无法被除 1 之外任何平方数整除的数字
    public static boolean check(long num) {
        for (int i = 2; ; i++) {
            if (num % (i * i) == 0) {
                return false;
            }
            if (num < (i * i)) {
                break;
            }
        }
        return true;
    }
}
